Ant colony optimization with semi random initialization for nurse rostering problem

A nurse rostering problem is an NP-Hard that difficult to solve during the complexity of problem. Since good scheduling schedule fulfilled hard constraint and minimizes violation soft constraint, a lot approaches implemented improve quality schedule. This research proposed improvement on ant colony optimization with semi-random initialization for problems. Semi-random applied avoid then will be minimized using optimization. construction solution phase by assigning nurses directly shift related so avoided from beginning part. The process complete pheromone value giving weight rest available process. method tested real-world taken St. General Hospital Elisabeth. objective function formulated minimize constraints balance workload. performance examined different dimension problems, same number iteration. also compared conventional genetic algorithm comparison. experiment result shows performs better small medium success about 24%. gets lowest 0,76 124 1.